Minimally projectively embeddable Steiner systems
نویسندگان
چکیده
منابع مشابه
DISCO – DIStributed Embeddable Systems for COntrol Applications
Fieldbus based distributed systems used in real-time applications tend to be inflexible and are often developed without taking into account the possibility to adapt on-line application requirements such as control parameters. In this paper it is presented an overview of a project called DISCO that aims at achieving better, simpler and more flexible solutions for distributed embedded systems use...
متن کاملMinimally invasive awake craniotomy using Steiner-Lindquist stereotactic laser guidance.
INTRODUCTION Awake craniotomy permits the continuous assessment of intraoperative neurological functions. In addition, stereotactic laser guidance aids in performing minimally invasive procedures related to the radical resection of lesions located in eloquent and non-eloquent brain regions. METHODS Between May 2000 and October 2006, 117 consecutive patients with various intracranial tumoral l...
متن کاملBicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the color classes. In this paper we give necessary conditions for the existence of a bicoloring with 3 color classes and give a multiplication theorem for Steiner triple systems with 3 color classes. We also examine bicolo...
متن کاملBalanced Steiner Triple Systems
A Steiner triple system of order v (briefly STS(v)) is a pair (X, B), where X is a v-element set and B is a collection of 3-subsets of X (triples), such that every pair of X is contained in exactly one triple of B. It is well known that a necessary and sufficient condition for a STS(v) to exist is that v#1 or 3 (mod 6). An r-coloring of a STS(v) is a map , : X [1, ..., r] such that at least two...
متن کاملCliques in Steiner Systems
A partial Steiner (k, l)-system is a k-uniform hypergraph G with the property that every l-element subset of V is contained in at most one edge of G . In this paper we show that for given k, l and t there exists a partial Steiner (k, l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90347-6